A NOTE ON INCOMPLETE REGULAR TOURNAMENTS WITH HANDICAP TWO OF ORDER n ≡ 8 (mod 16)
نویسندگان
چکیده
A d-handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(xi) = i and the sequence of weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑ xixj ∈E f(xj)) forms an increasing arithmetic progression with common difference d. A graph G is a d-handicap distance antimagic graph if it allows a d-handicap distance antimagic labeling. We construct a class of k-regular 2-handicap distance antimagic graphs for every order n ≡ 8 (mod 16), n ≥ 56 and 6 ≤ k ≤ n− 50.
منابع مشابه
Regular handicap tournaments of high degree
A handicap distance antimagic labeling of a graph G = (V,E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(xi) = i and the sequence of the weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑ xj∈N(xi) f(xj)) forms an increasing arithmetic progression with difference one. A graph G is a handicap distance antimagic graph if it allows a handicap distance antimagi...
متن کاملHandicap distance antimagic graphs and incomplete tournaments
Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer μ such that ∑ u∈N(v) f(u) = μ for all v ∈ V, where N(v) is the open neighborhood of v. The constant μ is called the magic constant of the labeling f. Any graph which admits a distance magic labeling is called a distance magic graph. The bijection...
متن کاملA note on the new basis in the mod 2 Steenrod algebra
The Mod $2$ Steenrod algebra is a Hopf algebra that consists of the primary cohomology operations, denoted by $Sq^n$, between the cohomology groups with $mathbb{Z}_2$ coefficients of any topological space. Regarding to its vector space structure over $mathbb{Z}_2$, it has many base systems and some of the base systems can also be restricted to its sub algebras. On the contrary, in ...
متن کاملA Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n−1 3 . A known construction shows this number is best possible when n ≡ 1 mod 3 and gives similar minimal values for n congruent to 0 and 2 modulo 3. A tournament T = (V, A) is an oriented complete graph. Let hp(T ) be the number of distinct hamiltonian paths in T (i.e., directed paths that in...
متن کاملPacking Triangles in Regular Tournaments
We prove that a regular tournament with n vertices has more than n 2 11.5 (1 − o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n 2 8 , so these tournaments do not have n 8 pairwise arc-disjoint triangles. These improve upon the best known bounds for this problem.
متن کامل